1,672 research outputs found
Adaptive and Robust Channel Estimation for Pilot-aided OFDM Systems
A time domain interpolation method is presented and applied to channel estimation for pilot-aided Orthogonal Frequency Division Multiplexing (OFDM) system. One key advantage of this method is that it dynamically selects suitable basis functions to approximate the channel transfer function by studying the shape of its Inverse Fourier transform. Which results in a very good approximation by using as few as possible basis functions, and provides significant reduction of additive white Gaussian noise (AWGN) and Inter Carrier Interference (ICI) at the same time. Theoretical analysis and simulations show that it is an efficient method for approximating various kinds of OFDM channels
Efficient FFT-based Circulant Embedding Method and Subspace Algorithms for Wideband Single-carrier Equalization
In single-carrier transmission systems, wider bandwidth allows higher data rate by transmitting narrower pulses. For wireless applications, however, this means that the effective channel response is longer and the number of significant taps increases. This results in higher computational burden at the receiver. In this paper, we first review some well-known equalization methods and their shortcomings. Then we will propose the use of the circulant embedding method and the CG algorithm as efficient equalizers that are specifically well suited in dealing with long delay spread channels. These methods take advantage of the low computational complexity of the FFT algorithm, resulting in the same overall computational complexity of N log(N). Furthermore, when the CG algorithm is used correctly, it may perform better than the MMSE equalizer at a much lower cos
Constructing packings in Grassmannian manifolds via alternating projection
This paper describes a numerical method for finding good packings in
Grassmannian manifolds equipped with various metrics. This investigation also
encompasses packing in projective spaces. In each case, producing a good
packing is equivalent to constructing a matrix that has certain structural and
spectral properties. By alternately enforcing the structural condition and then
the spectral condition, it is often possible to reach a matrix that satisfies
both. One may then extract a packing from this matrix.
This approach is both powerful and versatile. In cases where experiments have
been performed, the alternating projection method yields packings that compete
with the best packings recorded. It also extends to problems that have not been
studied numerically. For example, it can be used to produce packings of
subspaces in real and complex Grassmannian spaces equipped with the
Fubini--Study distance; these packings are valuable in wireless communications.
One can prove that some of the novel configurations constructed by the
algorithm have packing diameters that are nearly optimal.Comment: 41 pages, 7 tables, 4 figure
Randomized Kaczmarz solver for noisy linear systems
The Kaczmarz method is an iterative algorithm for solving systems of linear
equations Ax=b. Theoretical convergence rates for this algorithm were largely
unknown until recently when work was done on a randomized version of the
algorithm. It was proved that for overdetermined systems, the randomized
Kaczmarz method converges with expected exponential rate, independent of the
number of equations in the system. Here we analyze the case where the system
Ax=b is corrupted by noise, so we consider the system where Ax is approximately
b + r where r is an arbitrary error vector. We prove that in this noisy
version, the randomized method reaches an error threshold dependent on the
matrix A with the same rate as in the error-free case. We provide examples
showing our results are sharp in the general context
Compressive Inverse Scattering II. SISO Measurements with Born scatterers
Inverse scattering methods capable of compressive imaging are proposed and
analyzed. The methods employ randomly and repeatedly (multiple-shot) the
single-input-single-output (SISO) measurements in which the probe frequencies,
the incident and the sampling directions are related in a precise way and are
capable of recovering exactly scatterers of sufficiently low sparsity.
For point targets, various sampling techniques are proposed to transform the
scattering matrix into the random Fourier matrix. The results for point targets
are then extended to the case of localized extended targets by interpolating
from grid points. In particular, an explicit error bound is derived for the
piece-wise constant interpolation which is shown to be a practical way of
discretizing localized extended targets and enabling the compressed sensing
techniques.
For distributed extended targets, the Littlewood-Paley basis is used in
analysis. A specially designed sampling scheme then transforms the scattering
matrix into a block-diagonal matrix with each block being the random Fourier
matrix corresponding to one of the multiple dyadic scales of the extended
target. In other words by the Littlewood-Paley basis and the proposed sampling
scheme the different dyadic scales of the target are decoupled and therefore
can be reconstructed scale-by-scale by the proposed method. Moreover, with
probes of any single frequency \om the coefficients in the Littlewood-Paley
expansion for scales up to \om/(2\pi) can be exactly recovered.Comment: Add a new section (Section 3) on localized extended target
Analysis of Basis Pursuit Via Capacity Sets
Finding the sparsest solution for an under-determined linear system
of equations is of interest in many applications. This problem is
known to be NP-hard. Recent work studied conditions on the support size of
that allow its recovery using L1-minimization, via the Basis Pursuit
algorithm. These conditions are often relying on a scalar property of
called the mutual-coherence. In this work we introduce an alternative set of
features of an arbitrarily given , called the "capacity sets". We show how
those could be used to analyze the performance of the basis pursuit, leading to
improved bounds and predictions of performance. Both theoretical and numerical
methods are presented, all using the capacity values, and shown to lead to
improved assessments of the basis pursuit success in finding the sparest
solution of
Sparse Randomized Kaczmarz for Support Recovery of Jointly Sparse Corrupted Multiple Measurement Vectors
While single measurement vector (SMV) models have been widely studied in
signal processing, there is a surging interest in addressing the multiple
measurement vectors (MMV) problem. In the MMV setting, more than one
measurement vector is available and the multiple signals to be recovered share
some commonalities such as a common support. Applications in which MMV is a
naturally occurring phenomenon include online streaming, medical imaging, and
video recovery. This work presents a stochastic iterative algorithm for the
support recovery of jointly sparse corrupted MMV. We present a variant of the
Sparse Randomized Kaczmarz algorithm for corrupted MMV and compare our proposed
method with an existing Kaczmarz type algorithm for MMV problems. We also
showcase the usefulness of our approach in the online (streaming) setting and
provide empirical evidence that suggests the robustness of the proposed method
to the distribution of the corruption and the number of corruptions occurring.Comment: 13 pages, 6 figure
An optimally concentrated Gabor transform for localized time-frequency components
Gabor analysis is one of the most common instances of time-frequency signal
analysis. Choosing a suitable window for the Gabor transform of a signal is
often a challenge for practical applications, in particular in audio signal
processing. Many time-frequency (TF) patterns of different shapes may be
present in a signal and they can not all be sparsely represented in the same
spectrogram. We propose several algorithms, which provide optimal windows for a
user-selected TF pattern with respect to different concentration criteria. We
base our optimization algorithm on -norms as measure of TF spreading. For
a given number of sampling points in the TF plane we also propose optimal
lattices to be used with the obtained windows. We illustrate the potentiality
of the method on selected numerical examples
MUBs inequivalence and affine planes
There are fairly large families of unitarily inequivalent complete sets of
N+1 mutually unbiased bases (MUBs) in C^N for various prime powers N. The
number of such sets is not bounded above by any polynomial as a function of N.
While it is standard that there is a superficial similarity between complete
sets of MUBs and finite affine planes, there is an intimate relationship
between these large families and affine planes. This note briefly summarizes
"old" results that do not appear to be well-known concerning known families of
complete sets of MUBs and their associated planes.Comment: This is the version of this paper appearing in J. Mathematical
Physics 53, 032204 (2012) except for format changes due to the journal's
style policie
Symmetric Informationally Complete Quantum Measurements
We consider the existence in arbitrary finite dimensions d of a POVM
comprised of d^2 rank-one operators all of whose operator inner products are
equal. Such a set is called a ``symmetric, informationally complete'' POVM
(SIC-POVM) and is equivalent to a set of d^2 equiangular lines in C^d.
SIC-POVMs are relevant for quantum state tomography, quantum cryptography, and
foundational issues in quantum mechanics. We construct SIC-POVMs in dimensions
two, three, and four. We further conjecture that a particular kind of
group-covariant SIC-POVM exists in arbitrary dimensions, providing numerical
results up to dimension 45 to bolster this claim.Comment: 8 page
- …